Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
711	A black box for online approximate pattern matching Rapha¨el Clifforda,∗, Klim Efremenkob , Benny Poratc , Ely Poratc a Department of Computer Science, University of Bristol,UK University, Dept. of Computer Science, 5 Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:17 Dynamic programming Computational complexity theory Approximate string matching Pattern matching Time complexity Fast Fourier transform String searching algorithm Matching Knuth–Morris–Pratt algorithm Theoretical computer science Applied mathematics Mathematics
712	UPDATE ON PRIMALITY TESTING SERGEI V. KONYAGIN AND CARL POMERANCE Abstract. We discuss recent developments in the ﬁeld of primality testing since the appearance [10] of our joint paper On primes recognizable in determi Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2013-03-26 10:46:38 Mathematics AKS primality test Prime number Miller–Rabin primality test Integer factorization Randomized algorithm Time complexity Quadratic residue Jacobi symbol Theoretical computer science Computational complexity theory Primality tests
713	Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate Philip M. Long Google Add to Reading List Source URL: www.phillong.info Language: English - Date: 2013-08-07 12:09:14 XTR Maximum likelihood Time complexity Spectral theory of ordinary differential equations Non-analytic smooth function Theoretical computer science Mathematics Applied mathematics
714	Pattern matching in pseudo real-time Rapha¨el Clifforda , Benjamin Sacha,∗ a Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:17 String matching algorithms Computational complexity theory Donald Knuth Knuth–Morris–Pratt algorithm Time complexity String searching algorithm Matching Approximate string matching Levenshtein distance Theoretical computer science Applied mathematics Dynamic programming
715	Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering Nader H. Bshouty Technion Add to Reading List Source URL: www.phillong.info Language: English - Date: 2013-08-07 11:59:10 NP-complete problems Cluster analysis Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Graph partition Neighbourhood Correlation clustering Graph theory Theoretical computer science Mathematics
716	Better External Memory Suffix Array Construction Roman Dementiev∗, Juha K¨arkk¨ainen†, Jens Mehnert‡, Peter Sanders∗ implemented to work well with external memory for practical inputs. In contrast, the only pre Add to Reading List Source URL: algo2.iti.kit.edu Language: English - Date: 2005-01-03 12:10:50 Mathematics Sorting algorithms Computational complexity theory Arrays Suffix array Time complexity Asymptotically optimal algorithm Algorithm Binary search algorithm Theoretical computer science Applied mathematics Analysis of algorithms
717	A COMPLEXITY THEORY OF CONSTRUCTIBLE FUNCTIONS AND SHEAVES SAUGATA BASU Abstract. In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model. Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2013-10-06 09:48:25 Algebraic topology Structural complexity theory Field theory Time hierarchy theorem Constructible sheaf Algebraic geometry Sheaf Constructible function Constructible universe Abstract algebra Mathematics Algebra
718	POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA’S THEOREM SAUGATA BASU AND THIERRY ZELL 1. Brief Description Toda proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the cl Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2010-06-16 13:35:58 Field theory Algebraic geometry Polynomial Field extension Field Computational complexity theory Betti number Finite field Number Abstract algebra Mathematics Algebra
719	Journal of Machine Learning Research ? (????) ?-?? Submitted 5/09; Revised 10/09; Published ??/?? Learning Halfspaces with Malicious Noise Adam R. Klivans Add to Reading List Source URL: www.phillong.info Language: English - Date: 2013-08-07 12:06:18 Cybernetics Information Age Information theory Logarithm Time complexity Applied mathematics Mathematics Communication
720	Mismatch sampling Rapha¨el Clifford∗1 , Klim Efremenko2 , Benny Porat3 , Ely Porat3 , and Amir Rothschild4 1 2 Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 Computational complexity theory Probabilistic complexity theory Randomized algorithm Time complexity Fast Fourier transform Theoretical computer science Applied mathematics Analysis of algorithms

UPDATE